Generating Geometric Graphs Using Automorphisms
نویسنده
چکیده
We outline an algorithm for generating nets, a “net” being a geometric graph embedded in a space on which some group acts transitively. We prove that any connected net in such a space can be generated by this process, which can also be regarded as a covering of the net by copies of a connected “transversal” subnet. This paper outlines some of the underlying theory supporting a crystal prediction and design program currently under development. The paper begins with some background in geometric group theory. Submitted: October 2010 Reviewed: January 2012 Revised: March 2012 Reviewed: May 2012 Revised: July 2012 Accepted: July 2012 Final: August 2012 Published: August 2012 Article type: Regular Paper Communicated by: G. Liotta Dedicated to W. Edwin Clark E-mail address: [email protected] (Gregory McColm) 508 McColm Generating Geometric Graphs Using Automorphisms
منابع مشابه
Generating an Indoor space routing graph using semantic-geometric method
The development of indoor Location-Based Services faces various challenges that one of which is the method of generating indoor routing graph. Due to the weaknesses of purely geometric methods for generating indoor routing graphs, a semantic-geometric method is proposed to cover the existing gaps in combining the semantic and geometric methods in this study. The proposed method uses the CityGML...
متن کاملA Riemann-Roch Theory for Sublattices of the Root Lattice An, Graph Automorphisms and Counting Cycles in Graphs
This thesis consists of two independent parts. In the first part of the thesis, we develop a Riemann-Roch theory for sublattices of the root lattice An extending the work of Baker and Norine (Advances in Mathematics, 215(2): 766-788, 2007) and study questions that arise from this theory. Our theory is based on the study of critical points of a certain simplicial distance function on a lattice a...
متن کاملMatroid Automorphisms And Symmetry Groups
For a subgroup W of the hyperoctahedral group On which is generated by reflections, we consider the linear dependence matroid MW on the column vectors corresponding to the reflections in W . We determine all possible automorphism groups of MW and determine when W ∼= Aut(MW ). This allows us to connect combinatorial and geometric symmetry. Applications to zonotopes are also considered. Signed gr...
متن کاملGenerating connected and biconnected graphs
We focus on the algorithm underlying the main result of [6]. This is an algebraic formula to generate all connected graphs in a recursive and efficient manner. The key feature is that each graph carries a scalar factor given by the inverse of the order of its group of automorphisms. In the present paper, we revise that algorithm on the level of graphs. Moreover, we extend the result subsequentl...
متن کاملAutomorphisms of F.K. Schmidt codes and a new method to derive cyclic sub-codes from algebraic geometric codes
We present a new method to obtain cyclic subcodes of algebraic geometric codes using their automorphisms. Automorphisms of algebraic geometric codes from F. K. Schmidt curves are proposed. We present an application of this method in designing frequency hopping sequences for spread spectrum systems. Algebraic geometric codes can provide sequences longer (better randomness) than the ones from Ree...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Graph Algorithms Appl.
دوره 16 شماره
صفحات -
تاریخ انتشار 2012